首页> 外文OA文献 >LiveBench-1: Continuous benchmarking of protein structure prediction servers
【2h】

LiveBench-1: Continuous benchmarking of protein structure prediction servers

机译:LiveBench-1:蛋白质结构预测服务器的持续基准测试

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We present a novel, continuous approach aimed at the large-scale assessment of the performance of available fold-recognition servers. Six popular servers were investigated: PDB-Blast, FFAS, T98-lib, GenTHREADER, 3D-PSSM, and INBGU. The assessment was conducted using as prediction targets a large number of selected protein structures released from October 1999 to April 2000. A target was selected if its sequence showed no significant similarity to any of the proteins previously available in the structural database. Overall, the servers were able to produce structurally similar models for one-half of the targets, but significantly accurate sequence-structure alignments were produced for only one-third of the targets. We further classified the targets into two sets: easy and hard. We found that all servers were able to find the correct answer for the vast majority of the easy targets if a structurally similar fold was present in the server's fold libraries. However, among the hard targets—where standard methods such as PSI-BLAST fail—the most sensitive fold-recognition servers were able to produce similar models for only 40% of the cases, half of which had a significantly accurate sequence-structure alignment. Among the hard targets, the presence of updated libraries appeared to be less critical for the ranking. An "ideally combined consensus" prediction, where the results of all servers are considered, would increase the percentage of correct assignments by 50%. Each server had a number of cases with a correct assignment, where the assignments of all the other servers were wrong. This emphasizes the benefits of considering more than one server in difficult prediction tasks. The LiveBench program (http://BioInfo.PL/LiveBench) is being continued, and all interested developers are cordially invited to join.
机译:我们提出了一种新颖的,连续的方法,旨在对可用的折叠识别服务器的性能进行大规模评估。研究了六种流行的服务器:PDB-Blast,FFAS,T98-lib,GenTHREADER,3D-PSSM和INBGU。使用从1999年10月到2000年4月发布的大量选定的蛋白质结构作为预测目标进行了评估。如果目标的序列与以前在结构数据库中可用的蛋白质没有显着相似性,则选择目标。总体而言,服务器能够为一半的靶标产生结构相似的模型,但是仅三分之一的靶标产生了非常精确的序列结构比对。我们将目标进一步分为两组:简单和困难。我们发现,如果服务器的折叠库中存在结构相似的折叠,则所有服务器都可以为绝大多数简单目标找到正确的答案。但是,在硬性目标(如PSI-BLAST等标准方法失败)中,最敏感的折叠识别服务器仅能够针对40%的情况生成相似的模型,其中一半具有非常精确的序列结构比对。在硬性目标中,更新的库的存在似乎对于排名并不那么关键。考虑所有服务器结果的“理想组合共识”预测将使正确分配的百分比增加50%。每个服务器都有许多分配正确的案例,而所有其他服务器的分配都是错误的。这强调了在困难的预测任务中考虑不止一台服务器的好处。 LiveBench程序(http://BioInfo.PL/LiveBench)仍在继续,并诚挚邀请所有感兴趣的开发人员加入。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号